Finding the Functional Forms for Slowly Changing Dependencies
نویسندگان
چکیده
منابع مشابه
Sequences with Changing Dependencies
Consider words over an alphabet with n letters. Fisher [Amer. Math. Monthly, 96 (1989), pp. 610–614] calculated the number of distinct words of length ` assuming certain pairs of letters commute. In this paper we are interested in a more general setting where the pairs of letters that commute at a certain position of a word depend on the initial segment of the word. In particular, we show that ...
متن کاملFunctional Dependencies for XML
In this paper we address the problem of how to extend the deenition of functional dependencies (FDs) in incomplete relations to XML documents. An incomplete relation is said to strongly satisfy a FD if every completion of the relation, obtained by replacing all null values by data values, satisses the FD in the ordinary sense. We propose a syntactic deenition of strong FD satisfaction in a XML ...
متن کاملWeighted Kernel Regression for Predicting Changing Dependencies
Consider the online regression problem where the dependence of the outcome yt on the signal xt changes with time. Standard regression techniques, like Ridge Regression, do not perform well in tasks of this type. We propose two methods to handle this problem: WeCKAAR, a simple modification of an existing regression technique, and KAARCh, an application of the Aggregating Algorithm. Empirical res...
متن کاملFinding Dependencies from Defect History
Dependency analysis is an essential part of various software engineering activities like integration testing, reliability analysis and defect prediction. In this paper, we propose a new approach to identify dependencies between components and associate a notion of ―importance‖ with each dependency by mining the defect history of the system, which can be used to complement traditional dependency...
متن کاملA Functional Notation for Functional Dependencies
Functional dependencies help resolve many of the ambiguities that result from the use of multi-parameter type classes. They effectively enable writing programs at the type-level which significantly enhances the expressive power of Haskell’s type system. Among the applications of this technique are the emulation of dependent types, and precise typechecking for XML and HTML combinator libraries. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2009
ISSN: 1556-5068
DOI: 10.2139/ssrn.1350197